Numerical Methods for Computing Nonlinear Eigenpairs: Part I. Iso-Homogeneous Cases

نویسندگان

  • Xudong Yao
  • Jianxin Zhou
چکیده

With a Rayleigh quotient formulation, a local minimax method is developed to solve a class of (iso-homogeneous) nonlinear eigenpair problems for multiple solutions in Banach spaces following their instability order. The algorithm is implemented to compute (weighted) eigenpairs of the p-Laplacian. Numerical eigenfunctions are illustrated by their graphics. Several interesting phenomena have been observed and are open for further investigation. Mathematical analysis related to convergence and instability order of computed eigenfunctions, etc., are also presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Methods for Computing Nonlinear Eigenpairs: Part II. Non-Iso-Homogeneous Cases

Standing (solitary)-wave/steady-state solutions in many nonlinear wave motions and Schrodinger flows lead to nonlinear eigenproblems. In [X. Yao and J. Zhou, SIAM J. Sci. Comput., 29 (2007), pp. 1355-1374], a Rayleigh-local minimax method is developed to solve iso-homogeneous eigenproblems. In this subsequent paper, a unified method in Banach spaces is developed for solving non iso-homogeneous ...

متن کامل

Selection of Intermodal Conductivity Averaging Scheme for Unsaturated Flow in Homogeneous Media

The nonlinear solvers in numerical solution of water flow in variably saturated soils are prone to convergence difficulties. Many aspects can give rise to such difficulties, like very dry initial conditions, a steep pressure gradient and great variation of hydraulic conductivity occur across the wetting front during the infiltration of water.  So, the averaging method applied to compute hydraul...

متن کامل

Computing Tensor Eigenvalues via Homotopy Methods

We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor eigenpairs using mixed volume. Based on this bound and the structures of tensor eigenvalue problems, we propose two homotopy continuation type algorithms to solve ...

متن کامل

Robust Successive Computation of Eigenpairs for Nonlinear Eigenvalue Problems

Newton-based methods are well-established techniques for solving nonlinear eigen-value problems. If, however, a larger portion of the spectrum is sought, their tendency to reconverge to previously determined eigenpairs is a hindrance. To overcome this limitation, we propose and analyze a deflation strategy for nonlinear eigenvalue problems, based on the concept of minimal invariant pairs. We de...

متن کامل

A new algorithm for computing SAGBI bases up to an arbitrary degree

We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2007